package com.test.pat;

import java.util.ArrayList;
import java.util.Scanner;

/**
 * Public Bike Management
 * =============================================================
 * Version          Author          Date            Description
 * 1.0             01144895        2018/1/18             创建
 * =============================================================
 */
public class Java_0
{

    private static int MAX, N, ERRORSTATIONNO, PATH;

    private static ArrayList<Integer> CURRENTPATH = new ArrayList<Integer>();//暂存当前路径，退层的时候移除退层的那个点

    public static ArrayList<Integer> RESULT;//暂存已经得到的一条最短路径

    private static int MINTIME = Integer.MAX_VALUE;//暂存路径的行使时间

    private static int SEND;

    private static int COLLECT;

    private static boolean[] VISITED;

    private static int[] C;

    public static void main(String[] args)
    {

        init();
    }

    private static void init()
    {

        Scanner scanner = new Scanner(System.in);
        MAX = scanner.nextInt();
        N = scanner.nextInt();
        ERRORSTATIONNO = scanner.nextInt();
        PATH = scanner.nextInt();
        C = new int[N];
        int[][] adj = new int[N][N];
        VISITED = new boolean[N];
        for (int i = 1; i < N; i++)
        {
            C[i] = scanner.nextInt();
        }
        int Si, Sj, Tij;
        for (int i = 0; i < MAX; i++)
        {
            Si = scanner.nextInt();
            Sj = scanner.nextInt();
            Tij = scanner.nextInt();
            adj[Si][Sj] = Tij;
            adj[Sj][Si] = Tij;
        }
    }
}
